TSTP Solution File: SEV222^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV222^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:48 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of formulae : 85 ( 1 unt; 9 typ; 0 def)
% Number of atoms : 644 ( 193 equ; 0 cnn)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 630 ( 128 ~; 186 |; 43 &; 246 @)
% ( 12 <=>; 14 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 75 ( 75 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 119 ( 31 ^ 57 !; 30 ?; 119 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cZ: a > $o ).
thf(func_def_2,type,
cW: ( a > $o ) > $o ).
thf(func_def_9,type,
sK0: a ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > $o ).
thf(func_def_12,type,
sK3: a > $o ).
thf(func_def_15,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f122,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f47,f55,f56,f61,f62,f63,f64,f65,f66,f95,f99,f121]) ).
thf(f121,plain,
( ~ spl4_2
| spl4_4
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f120]) ).
thf(f120,plain,
( $false
| ~ spl4_2
| spl4_4
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f117]) ).
thf(f117,plain,
( ( $true = $false )
| ~ spl4_2
| spl4_4
| ~ spl4_6 ),
inference(superposition,[],[f54,f115]) ).
thf(f115,plain,
( ( ( cZ @ sK0 )
= $false )
| ~ spl4_2
| spl4_4 ),
inference(trivial_inequality_removal,[],[f114]) ).
thf(f114,plain,
( ( ( cZ @ sK0 )
= $false )
| ( $true != $true )
| ~ spl4_2
| spl4_4 ),
inference(superposition,[],[f46,f106]) ).
thf(f106,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
= $true )
| ( ( cZ @ X1 )
= $false ) )
| ~ spl4_2 ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f105,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
= $true )
| ( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= $false ) )
| ~ spl4_2 ),
inference(binary_proxy_clausification,[],[f103]) ).
thf(f103,plain,
( ! [X1: a] :
( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= ( sK1 @ X1 ) )
| ~ spl4_2 ),
inference(beta_eta_normalization,[],[f100]) ).
thf(f100,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) )
@ X1 )
= ( sK1 @ X1 ) )
| ~ spl4_2 ),
inference(argument_congruence,[],[f37]) ).
thf(f37,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl4_2
<=> ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f46,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| spl4_4 ),
inference(avatar_component_clause,[],[f44]) ).
thf(f44,plain,
( spl4_4
<=> ( $true
= ( sK1 @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f54,plain,
( ( $true
= ( cZ @ sK0 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f52,plain,
( spl4_6
<=> ( $true
= ( cZ @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
thf(f99,plain,
( ~ spl4_1
| spl4_3
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| ~ spl4_1
| spl4_3
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f97,f42]) ).
thf(f42,plain,
( ( ( sK3 @ sK0 )
!= $true )
| spl4_3 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl4_3
<=> ( ( sK3 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f97,plain,
( ( ( sK3 @ sK0 )
= $true )
| ~ spl4_1
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
( ( $true != $true )
| ( ( sK3 @ sK0 )
= $true )
| ~ spl4_1
| ~ spl4_5 ),
inference(superposition,[],[f50,f33]) ).
thf(f33,plain,
( ( ( cW @ sK3 )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl4_1
<=> ( ( cW @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f50,plain,
( ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f49,plain,
( spl4_5
<=> ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f95,plain,
( ~ spl4_2
| spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f94]) ).
thf(f94,plain,
( $false
| ~ spl4_2
| spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f90,f46]) ).
thf(f90,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ~ spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( $true
= ( sK1 @ sK0 ) )
| ( $true = $false )
| ~ spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f68,f75]) ).
thf(f75,plain,
( ! [X1: a] :
( ( ( sK2 @ X1 )
= $false )
| ( ( sK1 @ X1 )
= $true ) )
| ~ spl4_2 ),
inference(binary_proxy_clausification,[],[f73]) ).
thf(f73,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
= $true )
| ( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= $false ) )
| ~ spl4_2 ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f71,plain,
( ! [X1: a] :
( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= ( sK1 @ X1 ) )
| ~ spl4_2 ),
inference(beta_eta_normalization,[],[f69]) ).
thf(f69,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) )
@ X1 )
= ( sK1 @ X1 ) )
| ~ spl4_2 ),
inference(argument_congruence,[],[f37]) ).
thf(f68,plain,
( ( $true
= ( sK2 @ sK0 ) )
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f67,plain,
( ( $true != $true )
| ( $true
= ( sK2 @ sK0 ) )
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f50,f60]) ).
thf(f60,plain,
( ( ( cW @ sK2 )
= $true )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f58,plain,
( spl4_7
<=> ( ( cW @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
thf(f66,plain,
( ~ spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f23,f35,f40]) ).
thf(f23,plain,
( ( ( sK3 @ sK0 )
!= $true )
| ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( ( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
& ( ( cW @ sK2 )
= $true )
& ( $true
!= ( sK1 @ sK0 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( ( cW @ sK3 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( ( cW @ X5 )
!= $true ) )
| ( $true
= ( X4 @ sK0 ) ) )
| ( $true
= ( cZ @ sK0 ) )
| ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f14,f13,f12,f11]) ).
thf(f11,plain,
( ? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( ( cW @ X5 )
!= $true ) )
| ( ( X4 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ X0 ) ) ) ) )
=> ( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ sK0 )
!= $true ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( ( cW @ X5 )
!= $true ) )
| ( $true
= ( X4 @ sK0 ) ) )
| ( $true
= ( cZ @ sK0 ) )
| ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ sK0 )
!= $true ) )
=> ( ? [X2: a > $o] :
( ( sK1
= ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) ) )
& ( ( cW @ X2 )
= $true ) )
& ( $true
!= ( sK1 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X2: a > $o] :
( ( sK1
= ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) ) )
& ( ( cW @ X2 )
= $true ) )
=> ( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
& ( ( cW @ sK2 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
( ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) )
=> ( ( ( cW @ sK3 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( ( cW @ X5 )
!= $true ) )
| ( ( X4 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X6: a > $o] :
( ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ X0 ) ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f9,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) ) )
& ( ! [X1: a > $o] :
( ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) )
| ( ( X1 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( X3 @ X0 )
= $true ) ) ) ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 )
& ( ( cW @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ X0 )
!= $true ) ) ) )
& ( ! [X1: a > $o] :
( ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) )
| ( ( X1 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( X3 @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( X3 @ X0 )
= $true ) ) )
<~> ! [X1: a > $o] :
( ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) )
| ( ( X1 @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
=> ( ( X1 @ X0 )
= $true ) )
<=> ( ( ( cZ @ X0 )
= $true )
| ! [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
=> ( ( X3 @ X0 )
= $true ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
=> ( ( X1 @ X0 )
= $true ) )
<=> ( ! [X4: a > $o] :
( ( ( cW @ X4 )
= $true )
=> ( ( X4 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( X1
= ( ^ [X3: a] :
( ( cZ @ X3 )
| ( X2 @ X3 ) ) ) )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) )
<=> ( ! [X4: a > $o] :
( ( cW @ X4 )
=> ( X4 @ X0 ) )
| ( cZ @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( X1
= ( ^ [X3: a] :
( ( cZ @ X3 )
| ( X2 @ X3 ) ) ) )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) )
<=> ( ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) )
| ( cZ @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( X1
= ( ^ [X3: a] :
( ( cZ @ X3 )
| ( X2 @ X3 ) ) ) )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) )
<=> ( ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) )
| ( cZ @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bxx2H5zae8/Vampire---4.8_6563',cTHM60_pme) ).
thf(f65,plain,
( spl4_1
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f18,f44,f31]) ).
thf(f18,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| ( ( cW @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f64,plain,
( ~ spl4_6
| spl4_7 ),
inference(avatar_split_clause,[],[f22,f58,f52]) ).
thf(f22,plain,
( ( $true
!= ( cZ @ sK0 ) )
| ( ( cW @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f63,plain,
( spl4_7
| spl4_1 ),
inference(avatar_split_clause,[],[f21,f31,f58]) ).
thf(f21,plain,
( ( ( cW @ sK3 )
= $true )
| ( ( cW @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f62,plain,
( ~ spl4_6
| spl4_2 ),
inference(avatar_split_clause,[],[f25,f35,f52]) ).
thf(f25,plain,
( ( $true
!= ( cZ @ sK0 ) )
| ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f61,plain,
( spl4_7
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f20,f40,f58]) ).
thf(f20,plain,
( ( ( sK3 @ sK0 )
!= $true )
| ( ( cW @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f56,plain,
( ~ spl4_6
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f19,f44,f52]) ).
thf(f19,plain,
( ( $true
!= ( cZ @ sK0 ) )
| ( $true
!= ( sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f55,plain,
( spl4_5
| spl4_6
| spl4_5 ),
inference(avatar_split_clause,[],[f29,f49,f52,f49]) ).
thf(f29,plain,
! [X6: a > $o,X5: a > $o] :
( ( ( cW @ X5 )
!= $true )
| ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
= ( X5 @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(duplicate_literal_removal,[],[f28]) ).
thf(f28,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( X5 @ sK0 ) )
| ( ( cW @ X6 )
!= $true )
| ( ( cW @ X5 )
!= $true )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f27]) ).
thf(f27,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( ( X5 @ sK0 )
| ( cZ @ sK0 ) ) )
| ( $true
= ( X6 @ sK0 ) )
| ( ( cW @ X5 )
!= $true )
| ( $true
= ( cZ @ sK0 ) )
| ( ( cW @ X6 )
!= $true ) ),
inference(beta_eta_normalization,[],[f26]) ).
thf(f26,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
= ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) )
@ sK0 ) )
| ( $true
= ( X6 @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( ( cW @ X5 )
!= $true )
| ( ( cW @ X6 )
!= $true ) ),
inference(equality_resolution,[],[f16]) ).
thf(f16,plain,
! [X6: a > $o,X4: a > $o,X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( ( cW @ X5 )
!= $true )
| ( $true
= ( X4 @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( ( cW @ X6 )
!= $true )
| ( $true
= ( X6 @ sK0 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f47,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f17,f44,f40]) ).
thf(f17,plain,
( ( $true
!= ( sK1 @ sK0 ) )
| ( ( sK3 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f38,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f24,f35,f31]) ).
thf(f24,plain,
( ( ( cW @ sK3 )
= $true )
| ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV222^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:50:57 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.bxx2H5zae8/Vampire---4.8_6563
% 0.15/0.38 % (6814)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.38 % (6816)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.38 % (6815)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.39 % (6818)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.39 % (6817)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.39 % (6819)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.39 % (6820)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.39 % (6821)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.39 % (6818)Instruction limit reached!
% 0.15/0.39 % (6818)------------------------------
% 0.15/0.39 % (6818)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6818)Termination reason: Unknown
% 0.15/0.39 % (6818)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (6818)Memory used [KB]: 895
% 0.15/0.39 % (6818)Time elapsed: 0.003 s
% 0.15/0.39 % (6818)Instructions burned: 2 (million)
% 0.15/0.39 % (6818)------------------------------
% 0.15/0.39 % (6818)------------------------------
% 0.15/0.39 % (6817)Instruction limit reached!
% 0.15/0.39 % (6817)------------------------------
% 0.15/0.39 % (6817)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6817)Termination reason: Unknown
% 0.15/0.39 % (6817)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (6817)Memory used [KB]: 5500
% 0.15/0.39 % (6817)Time elapsed: 0.004 s
% 0.15/0.39 % (6817)Instructions burned: 2 (million)
% 0.15/0.39 % (6817)------------------------------
% 0.15/0.39 % (6817)------------------------------
% 0.15/0.39 % (6814)First to succeed.
% 0.15/0.39 % (6821)Instruction limit reached!
% 0.15/0.39 % (6821)------------------------------
% 0.15/0.39 % (6821)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6821)Termination reason: Unknown
% 0.15/0.39 % (6821)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (6821)Memory used [KB]: 5500
% 0.15/0.39 % (6821)Time elapsed: 0.005 s
% 0.15/0.39 % (6821)Instructions burned: 3 (million)
% 0.15/0.39 % (6821)------------------------------
% 0.15/0.39 % (6821)------------------------------
% 0.15/0.39 % (6815)Instruction limit reached!
% 0.15/0.39 % (6815)------------------------------
% 0.15/0.39 % (6815)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6815)Termination reason: Unknown
% 0.15/0.39 % (6815)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (6815)Memory used [KB]: 5500
% 0.15/0.39 % (6815)Time elapsed: 0.007 s
% 0.15/0.39 % (6815)Instructions burned: 5 (million)
% 0.15/0.39 % (6815)------------------------------
% 0.15/0.39 % (6815)------------------------------
% 0.15/0.39 % (6814)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.39 % (6814)------------------------------
% 0.15/0.39 % (6814)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (6814)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (6814)Memory used [KB]: 5500
% 0.15/0.39 % (6814)Time elapsed: 0.009 s
% 0.15/0.39 % (6814)Instructions burned: 6 (million)
% 0.15/0.39 % (6814)------------------------------
% 0.15/0.39 % (6814)------------------------------
% 0.15/0.39 % (6813)Success in time 0.005 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------